Applications of Second Order Cone Programming
نویسنده
چکیده
A significant special case of the problems which could be solved were those whose constraints were given by semidefinite cones. A Semidefinite Program (SDP) is an optimisation over the intersection of an affine set and cone of positive semidefinite matrices (Alizadeh and Goldfarb, 2001). Cone programming is discussed more in Section 3. Within semidefinite programming there is a smaller set of problems which can be modelled as Second Order Cone Programs (SOCPs), discussed more in Section 4. These have a wide range of applications, some of which are discussed in Section 5, and can still be solved efficiently using interior point methods. Lobo et al. (1998) justifies that the study of SOCPs in their own right is warranted. Software for solving SOCPs is now readily available, see Mittelmann (2012) for an overview on existing code.
منابع مشابه
Solving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملA Note on the Simplex Method for 2-Dimensional Second-Order Cone Programming
We transform a 2-dimensional second-order cone program to a standard linear program in order to pivot a vector based on its three states. Related properties of the transformation are given. Based on the transformation, we interpret the simplex method and its sensitivity analysis for the 2-dimensional second-order cone programming, especially the state changes. Finally, we give some applications...
متن کاملThe Q Method for Symmetric Cone Programming
The Q method of semidefinite programming, developed by Alizadeh, Haeberly and Overton, is extended to optimization problems over symmetric cones. At each iteration of the Q method, eigenvalues and Jordan frames of decision variables are updated using Newton’s method. We give an interior point and a pure Newton’s method based on the Q method. In another paper, the authors have shown that the Q m...
متن کاملA Polynomial Primal-Dual Path-Following Algorithm for Second-order Cone Programming
Second-order cone programming (SOCP) is the problem of minimizing linear objective function over cross-section of second-order cones and an a ne space. Recently this problem gets more attention because of its various important applications including quadratically constrained convex quadratic programming. In this paper we deal with a primal-dual path-following algorithm for SOCP to show many of ...
متن کامل